Permutations with coefficients in a subfield
نویسندگان
چکیده
منابع مشابه
A Stream Cipher Based on Chaotic Permutations
In this paper we introduce a word-based stream cipher consisting of a chaotic part operating as a chaotic permutation and a linear part, both of which designed on a finite field. We will show that this system can operate in both synchronized and self-synchronized modes. More specifically, we show that in the self-synchronized mode the stream cipher has a receiver operating as an unknown input o...
متن کاملPower integral bases in sextic fields with a cubic subfield
In the present paper we give an algorithm to compute generators of power integral bases having ”small” coordinates in an integral basis in sextic fields containing a cubic subfield. As an application of the method, we give a sufficient condition for infinite parametric families of number fields of this type to have power integral basis. To illustrate the statement we construct parametric famili...
متن کاملInitial coefficients of starlike functions with real coefficients
The sharp bounds for the third and fourth coefficients of Ma-Minda starlike functions having fixed second coefficient are determined. These results are proved by using certain constraint coefficient problem for functions with positive real part whose coefficients are real and the first coefficient is kept fixed. Analogous results are obtained for a general class of close-to-convex functions
متن کاملCryptography over Sextic Extension with Cubic Subfield
UPLICkey cryptographic is the fundamental technology in secure communications. It was devised by Diffie and Hellman [8], in 1976, to secret key distribution. In 1985, Coblitz [5] and Miller [7] independently proposed the implementation of a public key cryptosystem [3] using elliptic curve. The elliptic curve discrete logarithm problem appeared to be much more difficult than above discussed algo...
متن کاملCovering n-Permutations with (n+1)-Permutations
Let Sn be the set of all permutations on [n] := {1, 2, . . . , n}. We denote by κn the smallest cardinality of a subset A of Sn+1 that “covers” Sn, in the sense that each π ∈ Sn may be found as an order-isomorphic subsequence of some π′ in A. What are general upper bounds on κn? If we randomly select νn elements of Sn+1, when does the probability that they cover Sn transition from 0 to 1? Can w...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Acta Arithmetica
سال: 1972
ISSN: 0065-1036,1730-6264
DOI: 10.4064/aa-21-1-131-135